Multicast Routing Architecture in Ad-Hoc Network

In this paper we propose multicast (Mcast) routing architecture that uses basic trees and their neighboring MNs (NMN) in ad-hoc network. The basic trees are generated based on hop-counts from mobile nodes (MN) toward arbitrary base node (BN). The NMNs of a specific MN on a basic tree are upper, lower or peer MNs that 1-hop away from it and controlled by other basic trees. These NMNs identify only whether they have Mcast group MNs in mapping table or not, and never broadcast MNs’ Mcast request. But MNs on an identical basic tree have to broadcast Mcast request to upper or lower MNs when they don’t have Mcast group in mapping table. And all MNs don’t have Mcast routing table but have only mapping table to convert logical address into physical IP address, also the mapping table has a tag-bit for NMNs and Mcast bit for indicating Mcast group joins or not. Thus the proposed Mcast routing architecture has effectiveness to solve shortcomings in ad-hoc and sensor networks because it can decrease effectively flooding traffic that restrict only to MNs on a basic tree and MNs don’t have Mcast routing table separately.